Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors

نویسندگان

  • Fan Chung Graham
  • Paul Horn
  • Jacob Hughes
چکیده

We consider a variant of the contact process concerning multi-commodity allocation on networks. In this process, the demands for several types of commodities are initially given at some specified vertices and then the demands spread interactively on a contact graph. To allocate supplies in such a dynamic setting, we use a modified version of PageRank vectors, called Kronecker PageRank, to identify vertices for shipping supplies. We analyze both the situation that the demand distribution evolves mostly in clusters around the initial vertices and the case that the demands spread to the whole network. We establish sharp upper bounds for the probability that the demands are satisfied as a function of PageRank vectors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-commodity Multimodal Splittable Logistics Hub Location Problem with Stochastic Demands

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

متن کامل

ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

متن کامل

Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

متن کامل

A Nonlinear Model for a Capacitated Location-allocation Problem with Bernoulli Demand using Sub-sources

This study presents a capacitated multi-facility location-allocation problem with stochastic demands based on a well-known distribution function. In this discrete environment, besides the capacitated facilities, we can employee the capacitated sub-source of each facility for satisfying demands of customers. The objective function is to find the optimal locations of facilities among a finite num...

متن کامل

A Multi-Commodity Market Approach to Power Load Management

Power load management is the concept of controlling the loads at the demand side in order to run energy systems more efficiently. Energy systems are inherently highly distributed and contain large number of loads, up to some million. This implies that computationally and conceptually attractive methods are required for this application. In this paper we give two novel theorems for how to decomp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012